package work.binarysearch;

public class Problem33 {

    public int search(int[] nums, int target) {
        int n = nums.length;
        if (n == 0) {
            return -1;
        }
        if (n == 1) {
            return nums[0] == target ? 0 : -1;
        }
        int left = 0, right = n - 1;
        while (left <= right) {
            int mid = (left + right) / 2;
            if (nums[mid] == target) {
                return mid;
            } else if (nums[left] <= nums[mid]) {
                if (nums[left] <= target && target <= nums[mid]) {
                    right = mid - 1;
                } else left = mid + 1;
            } else {
                if (nums[mid] <= target && nums[right] >= target) {
                    left = mid + 1;
                } else right = mid - 1;
            }
        }
        return -1;
    }

    public static void main(String[] args) {
        Problem33 problem33 = new Problem33();
        int[] nums = {1, 3};
        problem33.search(nums,1);
    }
}
